Reliability of swarming algorithms for mobile sensor network applications

There are many well-studied swarming algorithms (for example, [2], [4], [5], [6], [7], [8], and [9]) which are often suited to very specific purposes. As mobile sensor networks become increasingly complex, and are comprised of more and more agents, it makes sense to consider swarming algorithms for movement control. We introduce a natural way to measure the reliability of various swarming algorithms so a balance can be struck between algorithmic complexity and sampling accuracy. The main idea is to utilize relatively well-developed tools (see [1]) from areas like frame theory to provide theoretical guidance for algorithm selection.